منابع مشابه
Hypothesis testing by convex optimization
We discuss a general approach to hypothesis testing. The main “building block” of the proposed construction is a test for a pair of hypotheses in the situation where each particular hypothesis states that the vector of parameters identifying the distribution of observations belongs to a convex compact set associated with the hypothesis. This test, under appropriate assumptions, is nearly optima...
متن کاملSHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH
The main aim of the present study is to propose a modified harmony search (MHS) algorithm for size and shape optimization of structures. The standard harmony search (HS) algorithm is conceptualized using the musical process of searching for a perfect state of the harmony. It uses a stochastic random search instead of a gradient search. The proposed MHS algorithm is designed based on elitism. In...
متن کاملA Line Search Multigrid Method for Large-scale Convex Optimization
Abstract. We present a line search multigrid method based on Nash’s MG/OPT multilevel optimization approach for solving discretized versions of convex infinite dimensional optimization problems. Global convergence is proved under fairly minimal requirements on the minimization method used at all grid levels. In particular, our convergence proof does not require that these minimization, or so-ca...
متن کاملDistributed line search for multi-agent convex optimization
This note considers multi-agent systems seeking to optimize a convex aggregate function. We assume that the gradient of this function is distributed, meaning that each agent can compute its corresponding partial derivative with information about its neighbors and itself only. In such scenarios, the discrete-time implementation of the gradient descent method poses the basic challenge of determin...
متن کاملWeighted Multidimensional Search and Its Application to Convex Optimization
We present a weighted version of Megiddo's multidimensional search technique and use it to obtain faster algorithms for certain convex optimization problems in R d , for xed d. This leads to speed-ups by a factor of log d n for applications such as solving the Lagrangian duals of matroidal knapsack problems and of constrained optimum subgraph problems on graphs of bounded tree-width.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 1996
ISSN: 0022-3239,1573-2878
DOI: 10.1007/bf02190130